Approximate model and algorithms for precast supply chain scheduling problem with time-dependent transportation times

نویسندگان

چکیده

This paper focuses on the precast supply chain scheduling problem with time-dependent transportation time to minimise total weighted tardiness (PSCSP_TDT |TWT). In problem, an order sequence and several job sequences are be determined simultaneously. At first, through in-depth analysis of structure real data from a manufacturer, we approximate into three-stage by combining seven production stages one differentiation stage, then explore some useful properties schedules for problem. Subsequently, solve small instances PSCSP_TDT |TWT, propose model-based hybrid dynamic programming heuristic (AMHDPH) obtain lower bound as by-product algorithm. For dealing medium-or large instances, considering complexity four iterated greedy (AMHIG) algorithms integration constructive heuristics, structural solutions, greedy, correction heuristic. Comprehensive computational results show that AMHDPH generates tight bounds solves most optimality within 60 seconds. Whereas best AMHIG feasible solutions average gap below 5 percent around 70 instances.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

متن کامل

Supply Chain Scheduling Using a Transportation System Composed of Vehicle Routing Problem and Cross-Docking Approaches

This study considers a combination of cross-docking and vehicle routing problem (VRP) approachesto transport raw material and parts in a supply chain. The supply chain is composed of some supplierswhich are spread in different geographical zones and multiple shared vehicles with different speedsand capacities for transporting orders from the suppliers to a manufacturer. After ...

متن کامل

an assembly flow-shop scheduling problem with sequence-dependent setup and transportation times

in this paper, three-stage assembly flowshop scheduling is considered with respect to minimizing bi-objectives, namely mean flow time and mean tardiness. this problem is a model of production systems, which several production operations are done simultaneously and independently, and then produced components are collected and transferred to an assembly stage for the final operation. in this mode...

متن کامل

A Genetic Algorithm Developed for a Supply Chain Scheduling Problem

This paper concentrates on the minimization of total tardiness and earliness of orders in an integrated production and transportation scheduling problem in a two-stage supply chain. Moreover, several constraints are also considered, including time windows due dates, and suppliers and vehicles availability times. After presenting the mathematical model of the problem, a developed version of GA c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Production Research

سال: 2022

ISSN: ['1366-588X', '0020-7543']

DOI: https://doi.org/10.1080/00207543.2022.2057254